2D Parallel Architecture for Morphological Operators Supporting Multiple Shaped Structuring Elements
نویسندگان
چکیده
منابع مشابه
Parallel Decomposition of Generic Morphological Structuring Elements
The decomposition of a binary morphological structuring element is a well-known problem in pattern recognition that has often been addressed in the literature. Generally, only deterministic solutions have been considered, each relying on different assumptions. A different solution, with no such constraints, has been proposed by Anelli, Broggi and Destri: it is based on a stochastic evolutionary...
متن کاملMorphological Structuring Elements
For image processing systems that have a limited size of region of support, say 3 x 3, direct implementation of morphological operations by a structuring element larger than the prefixed size is impossible. The decomposition of morphological operations by a large structuring element into a sequence of recursive operations, each using a smaller structuring element, enables the implementation of ...
متن کاملDecomposition of Arbitrarily Shaped Binary Morphological Structuring Elements Using Genetic Algorithms
A number of different algorithms have been described in the literature for the decomposition of both convex binary morphological structuring elements and a specific subset of nonconvex ones. Nevertheless, up to now no deterministic solutions have been found to the problem of decomposing arbitrarily shaped structuring elements. This work presents a new stochastic approach based on Genetic Algori...
متن کاملExperiments on the Decomposition of Arbitrarily Shaped Binary Morphological Structuring Elements
The decomposition of binary structuring elements is a key problem in morphological image processing. So far only the decomposition of convex structuring elements and of speciic subsets of non-convex ones have been proposed in the literature. This work presents the results of a new approach, based on a Genetic Algorithm, in which no constraints are imposed on the shape of the initial structuring...
متن کاملFast computation of morphological operations with arbitrary structuring elements
This paper presents a general algorithm that performs basic mathematical morphology operations, like erosions and openings, with any arbitrary shaped structuring element in an efficient way. It is shown that our algorithm has a lower or equal complexity but better computing time than all comparable known methods.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2018
ISSN: 1877-0509
DOI: 10.1016/j.procs.2018.08.003